Scheduling algorithms for concurrent execution
نویسندگان
چکیده
منابع مشابه
Co-scheduling algorithms for high-throughput workload execution
This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, eac...
متن کاملAlgorithms for dynamic scheduling of unit execution time tasks
We analyze performance properties of list scheduling algorithms under various dynamic assumptions and different levels of knowledge available for scheduling, considering the case of unit execution time tasks. We focus on bounds for the ISF (immediate successors first) and MISF (maximum number of immediate successors first) scheduling strategies and show the difference from other bounds obtained...
متن کاملConcurrent Models for Object Execution
In previous work we developed a framework of computational models for the concurrent execution of functions on different levels of abstraction. It shows that the traditional sequential execution of function is just a possible implementation of an abstract computational model that allows for the concurrent execution of functions. We use this framework as base for the development of abstract comp...
متن کاملConcurrent Models for Function Execution
We derive an abstract computational model from a sequential computational model that is generally used for function execution. This abstract computational model allows for the concurrent execution of functions. We discuss concurrent models for function execution as implementations from the abstract computational model. We giv e an example of a particular concurrent function construct that can b...
متن کاملConcurrent Bist Synthesis and Test Scheduling Using Genetic Algorithms
This paper presents a new efficient method for concurrent BIST synthesis and test scheduling in high-level synthesis. The method maximizes concurrent testing of modules while performing the allocation of functional units, test registers, and multiplexers. The method is based on a genetic algorithm that efficiently explores the testable design space. The method was implemented using C++ on a Lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1977
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/20.2.132